منابع مشابه
Traces for coalgebraic components
This paper contributes a feedback operator, in the form of a monoidal trace, to the theory of coalgebraic, state-based modelling of components. The feedback operator on components is shown to satisfy the trace axioms of Joyal, Street and Verity. We employ McCurdy’s tube diagrams, an extension of standard string diagrams for monoidal categories, for representing and manipulating component diagra...
متن کاملFrom Coalgebraic to Monoidal Traces
The main result of this paper shows how coalgebraic traces, in suitable Kleisli categories, give rise to traced monoidal structure in those Kleisli categories, with finite coproducts as monoidal structure. At the heart of the matter lie partially additive monads inducing partially additive structure in their Kleisli categories. By applying the standard “Int” construction one obtains compact clo...
متن کاملCoalgebraic Infinite Traces and Kleisli Simulations
Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli simulation has been developed and it guarantees the soundness of those simulations wrt. finite trace semantics. Moreover, those simulations can be aided by f...
متن کاملA coalgebraic view on decorated traces
F. Bonchi, M. Bonsangue, 2,3 G. Caltais, 3,4 J. Rutten, 3,5 A. Silva, 3,5,6 1 ENS Lyon, Université de Lyon, LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA) 2 LIACS Leiden University, The Netherlands 3 Centrum voor Wiskunde en Informatica, The Netherlands 4 School of Computer Science Reykjavik University, Iceland 5 Radboud University Nijmegen, The Netherlands 6 HASLab / INESC TEC, Universidade do Minho,...
متن کاملMaximal traces and path-based coalgebraic temporal logics
This paper gives a general coalgebraic account of temporal logics whose semantics involves a notion of computation path. Examples of such logics include the logic CTL* for transition systems and the logic PCTL for probabilistic transition systems. Our path-based temporal logics are interpreted over coalgebras of endofunctors obtained as the composition of a computation type (e.g. nondeterminist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2011
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129510000551